package algorithm.graph;

/**
 * @author DengZhiYuan
 * @version 1.0
 * @date 2022/12/24 22:55
 */
public class Vertex {
    //顶点的编号id
    public int id;
    //从起始顶点到这个顶点的距离
    public int dist;

    public Vertex(int id, int dist) {
        this.id = id;
        this.dist = dist;
    }
}
